Saturated LTSs for Adhesive Rewriting Systems
نویسندگان
چکیده
G-Reactive Systems (GRSs) are a framework for the derivation of labelled transition systems (LTSs) from a set of unlabelled rules. A label for a transition from A to B is a context C[−] such that C[A] may perform a reaction and reach B. If either all contexts, or just the “minimal” ones, are considered, the resulting LTS is called saturated (GIPO, respectively). The borrowed contexts (BCs) technique addresses the issue in the setting of the DPO approach. Indeed, from an adhesive rewriting system (ARS) a GRS can be defined such that DPO derivations correspond to reactions, and BC derivations to transitions of the GIPO LTS. This paper extends the BCs technique in order to derive saturated LTSs for ARSs, applying it to capture bisimilarity for asynchronous calculi.
منابع مشابه
Processes for Adhesive Rewriting Systems
Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, including various modelling frameworks for concurrent and distributed systems. Here we begin the development of a truly concurrent semantics for adhesive rewriting systems by defining the fundamental notion of process, well-known fro...
متن کاملAbstract True Concurrency: Adhesive Processes
True Concurrency: Adhesive Processes Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, and Pawe l Sobociński 1 Dipartimento di Informatica, Università Ca’ Foscari di Venezia, Italy 2 Dipartimento di Informatica, Università di Pisa, Italy 3 Institut für Formale Methoden der Informatik, Universität Stuttgart, Germany 4 Computer Laboratory, University of Cambridge, United Kingdom Abst...
متن کاملStructured Operational Semantics for Graph Rewriting
Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics (LTS). While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general. Hence, the goal of this article is to obtain a compositional semantics for graph transformation system in analogy to the structural operational se...
متن کاملSequential and distributed on-the-fly computation of weak tau-confluence
The notion of τ -confluence provides a form of partial order reduction of Labelled Transition Systems (Ltss), by enabling to identify the τ -transitions, whose execution does not alter the observable behaviour of the system. Several forms of τ -confluence adequate with branching bisimulation were studied in the literature, ranging from strong to weak forms according to the length of τ -transiti...
متن کاملAdhesive Categories
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Double-pushout graph rewriting generalises well to rewriting on arbitrary adhesive categories.
متن کامل